Infinite Random Graphs with a view towards Quantum Gravity
نویسنده
چکیده
In this thesis we study random planar graphs and some of the tools and techniques used to address some related combinatorial problems. We give an account of generating function methods, mainly focusing on some analytic aspects of generating functions. Namely, we discuss the so-called singularity analysis process, a technique that allows the transfer of the singular behaviour of certain functions to the asymptotic behaviour of their Taylor coefficients. Furthermore, we collect a set of theorems for the study of solutions of certain functional equations, which are frequent in combinatorial problems. As an application of random graph theory, we discuss the dynamical triangulation model and the causal dynamical triangulation model of twodimensional quantum gravity. Finally, we study the Ising model on certain infinite random trees, constructed as “thermodynamic” limits of Ising systems on finite random trees. We give a detailed description of the distribution of infinite spin configurations. As an application, we study the magnetization properties of such systems and prove that they exhibit no spontaneous magnetization. The basic reason is that the infinite tree has a certain one dimensional feature despite the fact that we prove its Hausdorff dimension to be 2. Furthermore, we obtain results on the spectral dimension of the trees. iii
منابع مشابه
Random Geometry on the Sphere
We introduce and study a universal model of random geometry in two dimensions. To this end, we start from a discrete graph drawn on the sphere, which is chosen uniformly at random in a certain class of graphs with a given size n, for instance the class of all triangulations of the sphere with n faces. We equip the vertex set of the graph with the usual graph distance rescaled by the factor n−1/...
متن کاملAlgorithmic tools for simulations of vertex models on random graphs* t
We consider the coupling of ice-type vertex models to random, planar ¢4 quantum-gravity graphs. The wellestablished techniques for the simulation of dynamical triangulations and their dual ¢3 graphs are suitably adapted to the case of four-valent graphs. These methods are combined with a formulation of the loop algorithm for the simulation of the vertex model matter part. We present a prelimina...
متن کاملTwo-dimensional quantum gravity – a laboratory for fluctuating graphs and quenched connectivity disorder
This paper gives a brief introduction to using two-dimensional discrete and Euclidean quantum gravity approaches as a laboratory for studying the properties of fluctuating and frozen random graphs in interaction with “matter fields” represented by simple spin or vertex models. Due to the existence of numerous exact analytical results and predictions for comparison with simulational work, this i...
متن کاملExtending the Theory of Random Surfaces Appendix: Random Lattices and Matrix Models 28
The theory of embedded random surfaces, equivalent to two–dimensional quantum gravity coupled to matter, is reviewed, further developed and partly generalized to four dimensions. It is shown that the action of the Liouville field theory that describes random surfaces contains terms that have not been noticed previously. These terms are used to explain the phase diagram of the Sine–Gordon model ...
متن کاملar X iv : h ep - l at / 9 70 40 20 v 1 3 0 A pr 1 99 7 Potts Models on Feynman Diagrams
We investigate numerically and analytically Potts models on " thin " random graphs – generic Feynman diagrams, using the idea that such models may be expressed as the N → 1 limit of a matrix model. The thin random graphs in this limit are locally tree-like, in distinction to the " fat " random graphs that appear in the planar Feynman diagram limit, N → ∞, more familiar from discretized models o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011